Automatic Minimal Loop Extraction and Initialisation for Water Pipe Network Analysis

In the present research new algorithms for automatic minimal loop extraction and initialisation have been developed for water pipe network analysis. The present work converts water pipe networks into graph data structures with pipes as edges and nodes of the network as nodes of the graph. The Nested Breadth First Search (NBFS) algorithm has been developed for the automatic extraction of loops from the graph. The First Breadth First Search (BFS) gives the clue, as back edges for loops are finally extracted by applying another BFS with the help of vertices of the back edge. Heuristics have been developed to get minimal loops. Pipes are initialised with the help of extracted loops. Water pipe networks are analysed using the Hardy Cross equation for balanced discharges. The present technique can be used for leak detection and pressure determination in a pipe network in real-time.